Conditional bounds for the least quadratic non-residue and related problems
نویسندگان
چکیده
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for L-functions at s = 1. In particular, we derive explicit upper and lower bounds for L(1, χ) and ζ(1 + it), and deduce explicit bounds for the class number of imaginary quadratic fields. Finally, we improve the best known theoretical bounds for the least quadratic non-residue, and more generally, the least k-th power non-residue.
منابع مشابه
THE LEAST QUADRATIC NON-RESIDUE, VALUES OF L-FUNCTIONS AT s = 1, AND RELATED PROBLEMS
In this paper, we study explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for L-functions at s = 1. In part...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملSolving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملOn polynomial lower bounds based on complexity of SAT problems
A large amount of recent work in complexity theory seeks to prove tight lower bounds on problems within P under the Strong Exponential Time Hypothesis (SETH) and similar conjectures. Lower bounds for many problems can be proved via reduction from CNF formulas under SETH. More recently, work by Abboud, Hansen, Williams and Williams [3] proves bounds under reductions from more complex representat...
متن کاملThe Smallest Prime That Does Not Split Completely in a Number Field
We study the problem of bounding the least prime that does not split completely in a number field. This is a generalization of the classic problem of bounding the least quadratic non-residue. Here, we present two distinct approaches to this problem. The first is by studying the behavior of the Dedekind zeta function of the number field near 1, and the second by relating the problem to questions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 86 شماره
صفحات -
تاریخ انتشار 2015